Report on the 2001 SIGMOD and PODS Awards

نویسنده

  • Philip A. Bernstein
چکیده

The Annual SIGMOD and PODS Awards honor important contributors to the database field. The awards are presented at the annual SIGMOD/PODS Conference. For those of you who missed that presentation at the 2001 conference, this article reports on this year’s winners. Congratulations to all of them for these significant achievements. The SIGMOD Innovations award is given “For innovative and highly significant contributions of enduring value to the development, understanding, or use of database systems and databases.” This year’s winner is Prof. Rudolf Bayer of the Technical University of Munich, for his invention of the B-Tree (with Edward McCreight), of B-Tree prefix compression, and of lock coupling (a.k.a. crabbing) for concurrent access to B-Trees (with Mario Schkolnick). All of these techniques are widely used in commercial database products. Prof. Bayer has also made many other important research contributions to the database field over a 30 year career in the areas of transaction management, deductive database, digital libraries, and most recently OLAP where he developed (with Volker Markel) the UB-Tree index that exploits space-filling curves for multidimensional indexing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Decade of Database Research Publications

ABSTRACT We analyze the database research publications of four major core database technology conferences (SIGMOD, VLDB, ICDE, EDBT), two main theoretical database conferences (PODS, ICDT) and three database journals (TODS, VLDB Journal, TKDE) over a period of 10 years (2001 2010). Our analysis considers only regular papers as we do not include short papers, demo papers, posters, tutorials or p...

متن کامل

2009 SIGMOD / PODS Award Winners SIGMOD

of the 1999 SIGMOD paper: Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibitively expensive in terms of time and/or storage space in a data warehouse environment. It is advantageous to have fast, approximate answers to OLAP aggregation queries. In this paper, we prese...

متن کامل

Letter to SIGMOD Record Editor

On behalf of the computer department at the Faculty of Engineering, Alexandria University, EGYPT, I would like to take this opportunity to acknowledge, with great appreciation, the book donations during SIGMOD 2001, Santa Barbara and the help of the SIGMOD community at large. We especially acknowledge SIGMOD member's contribution, and the donations by publishers. We also want to express our spe...

متن کامل

Accessibility of the Database Literature

SIGMOD has had for the past few years an over-arching vision of enabling all information on the database field to be freely accessible to everyone. Of course, this goal runs smack into the economic realities of scientific publishing. So the SIGMOD Executive Committee over the period of 1997–2001 tempered its initial goals to the following strategy, emphasizing free CDROM accessibility first, fo...

متن کامل

Sigmod / Pods 2010

Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an active environment, they need to be able to support millions of queries due to the scale of the I nternet. No existing systems have achieved this level of scalability. NiagaraCQ addresses this problem by grouping continu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIGMOD Record

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2001